A Deep Improver of Two-move Chess Mate Problems
نویسندگان
چکیده
منابع مشابه
A Chess Composer of Two-Move Mate Problems
Computerized chess composers of mate problems are rare. Moreover, so far they do not produce either impressive or creative new mate problems. In this paper, we describe a model called CHESS COMPOSER. This model uses a 64-bit representation, an ordered version of Iterative-Deepening DepthFirst Search, and a quality function built with the help of two international masters in chess-problem compos...
متن کاملAn Improver of Chess Problems
Computer-chess programs achieve outstanding results at playing chess. However, no existing program can compose adequate chess problems. In this paper, we present a model that is capable of improving the quality of some of the existing chess problems. We have formalized a major part of the knowledge needed for evaluating the quality of chess problems. In the model, we attempt to improve a given ...
متن کاملEvolution of an Efficient Search Algorithm for the Mate-In-N Problem in Chess
We propose an approach for developing efficient search algorithms through genetic programming. Focusing on the game of chess we evolve entire game-tree search algorithms to solve the Mate-In-N problem: find a key move such that even with the best possible counterplays, the opponent cannot avoid being mated in (or before) move N . We show that our evolved search algorithms successfully solve sev...
متن کاملHow Relevant Are Chess Composition Conventions?
Composition conventions are guidelines used by human composers in composing chess problems. They are particularly significant in composition tournaments. Examples include, not having any ‘check’ in the first move of the solution and not ‘dressing up’ the board with unnecessary pieces. Conventions are often associated or even directly conflated with the overall aesthetics or beauty of a composit...
متن کاملThe Mate-in-n Problem of Infinite Chess Is Decidable
The mate-in-n problem of infinite chess—chess played on an infinite edgeless board—is the problem of determining whether a designated player can force a win from a given finite position in at most n moves. Although a straightforward formulation of this problem leads to assertions of high arithmetic complexity, with 2n alternating quantifiers, the main theorem of this article nevertheless confir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Cybernetics and Systems
دوره 37 شماره
صفحات -
تاریخ انتشار 2006